Concurrent computation of topological watershed on shared memory parallel machines
نویسندگان
چکیده
منابع مشابه
Real-time topological image smoothing on shared memory parallel machines
Smoothing filter is the method of choice for image preprocessing and pattern recognition. We present a new concurrent method for smoothing 2D object in binary case. Proposed method provides a parallel computation while preserving the topology by using homotopic transformations. We introduce an adapted parallelization strategy called split, distribute and merge (SDM) strategy which allows effici...
متن کاملParallel Sequence Mining on Shared-Memory Machines
We present pSPADE, a parallel algorithm for fast discovery of frequent sequences in large databases. pSPADE decomposes the original search space into smaller suffix-based classes. Each class can be solved in main-memory using efficient search techniques, and simple join operations. Further each class can be solved independently on each processor requiring no synchronization. However, dynamic in...
متن کاملParallel Algorithms for Shared-memory Machines. a Standard Wasteful Implementation
10 technique enables a simple cost-eeective implementation with little eeort. It was used for the rst time to implement a fast optimal parallel hashing algorithm 7]. The hashing algorithm in 7] comprises two parts: the rst part is a randomized geometric decaying algorithm which runs for O(lg lg n) steps. By using the technique of this paper and the O(lg lg n) time load balancing of 6], this par...
متن کاملParallel Graph Generation Algorithms for Shared and Distributed Memory Machines
In this paper we give an overview and a comparison of two parallel algorithms for the state space generation in stochastic modeling on common classes of multiprocessors In this context state space generation simply means constructing a graph which usually gets extremely large On shared memory machines the key problem for a parallelization is the implementation of a shared data structure which e...
متن کاملUMA Shared - memory Machines
Received (received date) Revised (revised date) Communicated by (Name of Editor) ABSTRACT Due to the complexity of programming scalable multiprocessors with physically distributed memories, it is onerous to manually generate parallel code for these machines. As a consequence, there has been much research on the development of compiler techniques to simplify programming, to increase reliability ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 2017
ISSN: 0167-8191
DOI: 10.1016/j.parco.2017.08.010